A New Look at the Burnside–schur Theorem
نویسندگان
چکیده
The famous Burnside–Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2-transitive or isomorphic to a subgroup of a 1-dimensional affine group of prime degree. It is known that this theorem can be expressed as a statement on Schur rings over a finite cyclic group. Generalizing the latter, Schur rings are introduced over a finite commutative ring, and an analogue of this statement is proved for them. Also, the finite local commutative rings are characterized in permutation group terms.
منابع مشابه
Linear Groups Containing a Singer Cycle*
I f G induces a primitive permutation group on the set X of points (l-spaces) of the underlying vector space V, then well-known results of Burnside [I, p. 3411 and Schur [6] imply that G acts on X 2-transitively or as a regular or Frobenius group of prime degree; the theorem then follows from [2; 51. We must thus take a nontrivial block of imprimitivity d for G on X, and analyze the action of G...
متن کاملThe Generalized Burnside Theorem in Noncommutative Deformation Theory
Let A be an associative algebra over a field k, and let M be a finite family of right A-modules. Study of the noncommutative deformation functor DefM : ar → Sets of the family M leads to the construction of the algebra O(M) of observables and the Generalized Burnside Theorem, due to Laudal [2]. In this paper, we give an overview of aspects of noncommutative deformations closely connected to the...
متن کامل2-Groups, 2-Characters, and Burnside Rings
We study 2-representations, i.e. actions of 2-groups on 2-vector spaces. Our main focus is character theory for 2-representations. To this end we employ the technique of extended Burnside rings. Our main theorem is that the Ganter-Kapranov 2-character is a particular mark homomorphism of the Burnside ring. As an application we give a new proof of Osorno formula for the Ganter-Kapranov 2-charact...
متن کاملWitt vectors . Part 1 Michiel
Witt#1: The Burnside Theorem [completed, not proofread] Theorem 1, the Burnside theorem ([1], 19.10). Let G be a finite group, and let X and Y be finite G-sets. Then, the following two assertions A and B are equivalent: Assertion A: We have X ∼ = Y , where ∼ = means isomorphism of G-sets.
متن کاملA Block Toeplitz Look - Ahead Schur
This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations with orthogonal polynomials. The simplicity of the matrix based approach ought to shed new light on other issues such as parallelism and numerical stability.
متن کامل